On the Area of Binary Tree Layouts
نویسندگان
چکیده
The binary tree is an important interconnection pattern for VLSI chip layouts. Suppose that the nodes are separated by at least unit distance and that a wire has unit width. The usual layout of a complete binary tree with n leaves takes chip area Ω(n log n), but it can be arranged that all the leaves are on the boundary of the chip. In contrast, the “recursive H” layout has area of order n, but has only O( √ n) leaves on the boundary. Thus, the recursive H layout enjoys a small area at the expense of a small number of possible I/O ports. This note shows that it is not possible to design a complete binary tree layout with area O(n) and all leaves on the boundary. More precisely, if the boundary of the chip is a convex plane curve and the leaves on the boundary are separated by at least unit distance, then area of order n log n is necessary just to accomodate all the wires. CommentsOnly the Abstract is given here. The full paper appeared as [2]. For related work, see [1, 3]. References[1] R. P. Brent and H. T. Kung, “The area-time complexity of binary multiplication”, Journal of the ACM 28(1981), 521–534. CR 22#38242, MR 82i:68027. Corrigendum: ibid 29 (1982), 904. MR 83j:68046. rpb055.[2] R. P. Brent and H. T. Kung, “On the area of binary tree layouts”, Information Processing Letters 11 (1980),46–48. Also appeared as Report TR-CS-79-07, Department of Computer Science, ANU (July 1979), 5 pp.rpb056.[3] R. P. Brent and L. M. Goldschlager, “Some area-time tradeoffs for VLSI”, SIAM J. on Computing 11 (1982),737–747. MR 83k:68024. rpb064. (Brent) Department of Computer Science, Australian National University, Canberra (Kung) Department of Computer Science, Carnegie-Mellon University, Pittsburgh 1991 Mathematics Subject Classification. Primary 68Q35; Secondary 65Y05, 68M07, 68Q25.
منابع مشابه
Generating Floor Plan Layouts with K-d Trees and Evolutionary Algorithms
K-dimensional trees, abbreviated as k-d trees in the following, are binary search and partitioning trees that represent a set of n points in a multi-dimensional space. K-d tree data structures have primarily been used for nearest neighbor queries and several other query types, for example in database applications. In the context of a research project at the Bauhaus-University Weimar concerned w...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملEffects of initial spacing on some allometric characteristics of 12-year-old Quercus castaneifolia plantation in central Mazandaran, Iranian Caspian forests
The effects of initial spacing layout on some allometric characteristics of 12-year-old Quercus castaneifolia trees grown in Central Mazandaran, north of Iran were examined. Trees were planted in 5 different layouts (1?1, 1.5?1.5, 2?2.5, 2?3 and 4?4 m). Tree height, diameter at breast height, natural pruning height and the survival of trees were recorded in each sample plot. Tree basal area and...
متن کاملA novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals
Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 11 شماره
صفحات -
تاریخ انتشار 1980